Contiguous Sphere Clusters. I. Isomorphic Chains

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contiguous Sphere Clusters. I. Isomorphic Chains

One of the remarkable phenomena (still unexplained) concomitant with the transmission of the "code of heredity" to succeeding generations (in sexually reproducing organisms) is "pairing" of the chromosomes at zygotene: That is, during the zygotene stage of meiosis (the process whereby the sex cells are formed) homologous chromosomes become "contiguous" at homologous sites (the chromomers) throu...

متن کامل

Isomorphic Factorisations . I : Complete Graphs

An isomorphic factorisation of the complete graph Kj, is a partition of the lines of Kp into t isomorphic spanning subgraphs G; we then write G\Kj, and G G K^/t. If the set of graphs Ky/t is not empty, then of course t\p(p — l)/2. Our principal purpose is to prove the converse. It was found by Laura Guidotti that the converse does hold whenever (/,/>) » 1 or (t,p — 1) «= 1, We give a new and sh...

متن کامل

Maximal Chains of Isomorphic Subgraphs of the Rado Graph

The partial order 〈E(R) ∪ {∅},⊂〉, where E(R) is the set of isomorphic subgraphs of the Rado graph R, is investigated. The order types of maximal chains in this poset are characterized as the order types of compact sets of reals having the minimum non-isolated. 2000 Mathematics Subject Classification: 05C80, 06A05, 06A06.

متن کامل

Maximal Chains of Isomorphic Suborders of Countable Ultrahomogeneous Partial Orders

We investigate the poset 〈P(X) ∪ {∅},⊂〉, where X is a countable ultrahomogeneous partial order and P(X) the set of suborders of X isomorphic to X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in 〈P(X) ∪ {∅},⊂〉 are characterized as the order types of compact (resp. compact and nowhere dense) sets of reals having the minimum non-isolated. 2000 Math...

متن کامل

Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs

For a countable ultrahomogeneous graph G = 〈G, ρ〉 let P(G) denote the collection of sets A ⊂ G such that 〈A, ρ ∩ [A]〉 ∼= G. The order types of maximal chains in the poset 〈P(G) ∪ {∅},⊂〉 are characterized as: (I) the order types of compact sets of reals having the minimum nonisolated, if G is the Rado graph or the Henson graph Hn, for some n ≥ 3; (II) the order types of compact nowhere dense set...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1961

ISSN: 0002-9939

DOI: 10.2307/2034879